例句與造句

1. A finite automaton can be defined by an explicit state transition table.
2. Stateflow also provides state transition tables and truth tables.
3. Another possible representation is the State transition table.
4. They posited that if the machine had a fixed state transition table, then it could not be morally responsible.
5. The LR ( 1 ) parser is a deterministic automaton and as such its operation is based on static state transition tables.
6. It's difficult to find state transition tables in a sentence. 用state transition tables造句挺難的
7. If the set of states " Q " is finite, then the transition functions are commonly represented as state transition tables.
8. Because of this Charles L . Richards invented a method of implementing a finite state machine that did not need an explicit state transition table.
9. This is denoted in a state transition table by a pair of curly braces " { } " with the set of all target states between them.
10. As with Turing machines, the actions are specified by a state transition table listing the current internal state of the turmite and the color of the cell it is currently standing on.
11. The Richards controller was made because of the need for an easier method of designing finite state machines than using the traditional method of state diagrams, state transition tables, and logic minimization.
12. These tools may generate source code that can be compiled and executed or construct a state transition table for a finite-state machine ( which is plugged into template code for compiling and executing ).
13. Simultaneous transitions in multiple finite state machines can be shown in what is effectively an n-dimensional state transition table in which pairs of rows map ( sets of ) current states to next states.
14. There is a wide variety of representations possible and one can express a given Turing machine program as a sequence of machine tables ( see more at finite state machine, state transition table and control table ), as flowcharts and drakon-charts ( see more at state diagram ), or as a form of rudimentary machine code or assembly code called " sets of quadruples " ( see more at Turing machine ).